Embedding processes in combinatorial game theory
نویسندگان
چکیده
منابع مشابه
using game theory techniques in self-organizing maps training
شبکه خود سازمانده پرکاربردترین شبکه عصبی برای انجام خوشه بندی و کوانتیزه نمودن برداری است. از زمان معرفی این شبکه تاکنون، از این روش در مسائل مختلف در حوزه های گوناگون استفاده و توسعه ها و بهبودهای متعددی برای آن ارائه شده است. شبکه خودسازمانده از تعدادی سلول برای تخمین تابع توزیع الگوهای ورودی در فضای چندبعدی استفاده می کند. احتمال وجود سلول مرده مشکلی اساسی در الگوریتم شبکه خودسازمانده به حسا...
Combinatorial Game Theory
Known complexity facts: the decision problem of the existence of a kernel in a digraph G = (V; E) is NP-complete; if all of the cycles of G have even length, then G has a kernel; and the question of the number of kernels is #P-complete even for this restricted class of digraphs. In the opposite direction, we construct game theory tools, of independent interest, concerning strategies in the pres...
متن کاملCombinatorial Game Theory Workshop
A main aim of the workshop was to bring together the two camps, mathematicians working in combinatorial game theory and computer scientists interested in algorithmics and Artificial intelligence. The Workshop attracted a mix of people from both communities (17 from mathematics, 16 from computer science and 2 undergraduates) as well as a mixture of new and established researchers. The oldest was...
متن کاملManagement of Uncertainty in Combinatorial Game Theory
We describe a method to handle uncertainty in combinatorial game theory. This method has been implemented in Gogol, a general game playing system mainly applied to the game of Go. In complex games such as Go, a search intensive approach is intractable. Gogol uses a lot of knowledge and little search. This knowledge is represented using combinatorial game theory. We have adapted this theory to t...
متن کاملCombinatorial game theory in chess endgames
It was already noted in [WW, p.16] that combinatorial game theory (CGT) does not apply directly to chess because the winner of a chess game is in general not determined by who makes the last move, and indeed a game may be neither won nor lost at all but drawn by infinite play. Still, CGT has been effectively applied to other games such as Dots-and-Boxes and Go which are not combinatorial games ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2011
ISSN: 0166-218X
DOI: 10.1016/j.dam.2010.11.019